home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
CD Exchange
/
CD Exchange - Volume 1.iso
/
games
/
pd
/
chess
/
doc
/
changes
< prev
next >
Wrap
Text File
|
1992-08-26
|
16KB
|
430 lines
GNU CHESS HISTORY
(#include "../version.h")
January 8, 1990 -- Hans Eric Sandstrom (hes@log-sv.se)
Changed the transpositon table to allow 66536 positions per player.
This means a 1.3 Mbyte hash table. Introduced simple rehashing. And
also made setting ttable 0 exclude all transposition code from
gnuchess (for machines with very little memory).
January 3, 1990 -- Tom Vijlbrief (tnosoes!tom@nluug.n)
Contributed code to fix undo of promotions.
And a bugfix RMBLY was to small.
January 27, 1990 -- Hans Eric Sandstrom (hes@log-sv.se)
Fixed nuxdsp.c to work with my changes (Saved games format)
January 26, 1990 -- Hans Eric Sandstrom (hes@log-sv.se)
Verified that the underpromotion routines works.
Found and fixed the bug that caused gnuchess to report mate
and draw prematurely.
January 25, 1990 -- Hans Eric Sandstrom (hes@log-sv.se)
Received the underpromotion additions from jhol@tolsun.oulu.fi
Made some optimizations in trapped and KingScan.
Added more comments on how to improve the search.
Added info on usage of the array Tree in post mode.
Changed the index in the transposition table to unsigned short to
allow a hash table of size 65536.
January 11, 1990 -- Hans Eric Sandstrom (hes@log-sv.se)
Formatted gnuchess according to GNU standards with indent.
January 9, 1990 -- Hans Eric Sandstrom (hes@log-sv.se)
Inserted a missing comma in KTHRT.
Removed mvstr1[5],mvstr2[5] from gnuchess.c, they are only used in the
user-interface routines uxdsp.c nondsp.c anyway.
Rewrote algbr to generate move strings for underpromotion. (ph8k or h7h8k)
Some optimizations in CaptureList.
Changed row, column and locn to macros.
Made memset default and introduced a switch NOMEMSET for computers without
memset or where memset is a speed penality. I tested this on:
Sparc - no change, DECstation - no change and Sun3/60 - 4% speed improvment.
Changed + to | in some bit-field manipulations.
Fixed the castle-with-moved-rook-bug, removed kingmoved and introduced
an array Mvboard to keep track on how many times we have moved from a
particular square.
Fixed the check for zero division in Time controls.
Added BINDIR and LIBDIR in the Makefile to set where gnuchess and
gnuchess.book gets installed.
All I have to do now is to test if all this works (-:
February 3, 1990 -- Tom Vijlbrief
Noticed an error in the rook mobility bonus. RMBLTY array was
indexed 0 to 14, but had only 14 members. Added final member.
January 1, 1990 -- Stuart Cracraft (cracraft @wheaties.ai.mit.edu)
Some special openings were inserted and some taken out.
A small change was made to allow the program to detect draws earlier
in the tree (via Stanback).
Thinking on opponent's time is now working in nondsp.c. For some
reason it had been deactivated.
Tested GNU Chess 1.55 with with Chesstool on a SUN.
Match vs. Fidelity Mach 3 (USCF 2265) resulted in 7-3 score for GNU
on a Sparcstation giving a 2325-2335 performance result.
January 1, 1990 -- Hes @log-se.sv
He contributed faster move generator routines.
August 1, 1989 -- Jay Scott
He proofread the opening book and made
corrections.
June 9, 1989 -- Tim Radzy (unet!nplab4!radz@ames.arc.nasa.gov)
He fixed a bug in xchess/board.c. In a post-game new-game situation,
castling wouldn't be permitted under circumstances. Tim made
it possible to castle again.
May 12, 1989 -- Joe Garbarini (garbarini%kegger@circus.llnl.gov)
Recommended changes to documentation vis a vis chesstool usage.
May 5, 1989 -- Jouko Holopainen (jhol@tolsun.oulu.fi)
Wrote code to support underpromotion.
Changed interface to accept ECO/Informator style moves.
April 30, 1989 -- Various GNU contributors
setlinebuf() modification for xchess/chesstool.
check for zero division in time printout.
January 17, 1989 -- Anders Thulin
Provided extensive addition to the opening book for his
favorite opening the Vienna Game. This was drawn from ECO.
November 23, 1988 -- Stuart Cracraft
Installed new version of Xchess that is better debugged, works on
the next version of X. Thanks to Wayne Christopher and Arturo Perez.
August 28, 1988 -- Stuart Cracraft
Removed a sacrifice line from the Giuoco Piano entry in the opening
book; the program didn't seem to like the positions it got from this line.
December 30, 1987 -- John Stanback
Wrote a short blurb on the heuristics contained in GNU Chess. It resides
in the subdirectory DOCUMENTATION as the file HEURISTICS.
December 17, 1987 -- John Stanback
Modified criteria for positional evaluation in quiescence search
to include positions in which the estimated score lies within
the alpha-beta window; fixed a bug in the king proximity to pawns heuristic;
fixed a bug involving passed pawn heuristics;
December 16, 1987 -- Stuart Cracraft
Added automatic 'list' upon exit (both in display, non-display, and
chesstool mode); command-line setting of tournament time controls
bug fixed.
December 14, 1987 -- John Stanback
GNU defeated the commercial product 'Fidelity Excellence' 5.5-4.5 in
a 10-game match. It was running at about 500 nodes per second (typical
of its speed on a VAX 8650) and this would indicate its strength
would be about USCF 1875-1900.
December 4, 1987 -- John Stanback
Man page added. Command line arguments now specify regular clock
settings if so desired (useful for SUN players). Thinking
on opponent's time is now disabled by default. Estimated
rating is 1850 at 500 nodes per second.
October 20, 1987 -- Stuart Cracraft
Fixed GNU/SUN interaction. Chesstool and its features now
seem to fully work.
October 5, 1987 -- Ken Thompson
GNU beat Belle (actually drew due to a bug, but
Ken kept GNU playing through to the win) while
running on a Cray XMP-48. In this 3-1 time handicap game
Belle outsearched Cray GNU by 10-1 (even with the handicap).
September 26, 1987 -- John Stanback at HP
Hash table functioning. Thinking on opponent's
time functioning.
August 20, 1987 -- Mike Meyer at Berkeley
Mike ran GNU Chess on a Cray 1 supercomputer.
The system was very heavily loaded, so the
program was not as speedy as with the Cray below.
August 16, 1987 -- David Goldberg at SUN
He added "chesstool" support so that this
version of GNU Chess can run under the
display manager "chesstool".
August 15, 1987 -- John Stanback at HP
Hash tables, more heuristics, a modified
search which is more efficient. He also
discovered a bug in the piece-exchanger. This
would cause the program to exchange pieces suboptimally.
With this fix, the program should play much
more strongly.
August 13, 1987 -- Ken Thompson at Bell Labs
Ken ran GNU Chess on a Cray XMP supercomputer
(among other processors). The program got
about 3000-4000 chess positions per second
which is comprable to today's fastest bit-slice
commercial machines. Also, he had GNU Chess
play two games against Belle.
July 19, 1987 -- Jay Scott & John Stanback
Many positional heuristics have been added.
July 18, 1987 -- Stuart Cracraft
Improvements have been made to the opening
book. It is mostly an MCO book, containing
major variations from many of the major openings
and particularly in-depth on Sicilian.
May 11, 1987 -- John Stanback at HP
He donated his chess program, a fairly mature
and strong program.
May 1, 1987 -- Stuart Cracraft
He added several bug fixes various people
had reported. He also changed makemove() so that
the calling syntax is makemove(movelist,index,board)
rather than makemove(move,board). Having the latter
tickled a bug in at least one manufacturer's C-compiler,
so rather than write fancy code, we simplified it.
April 25, 1987-- Jim Aspnes at MIT
He added all sorts of useful capabilities,
including positional evaluation in the tree
search using a table-driven algorithm,
modifying transposition table code in order
to work properly, though it doesn't improve
speed too much, checkmates/stalemates detected
in the search, en passant captures allowed,
detect repeated positions, iterative deepening,
quicker quiescence search, tournament time controls,
sqattacked sped up by a factor of 4, compile-time
debugging options.
January 2, 1987 -- Stuart Cracraft
He added a few more Tal games to the collection.
January 2, 1987 -- Jim Aspnes at MIT
He contri